Durative Planning in HTNs

نویسنده

  • Robert P. Goldman
چکیده

This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that cannot be expressed in simple first principles planners, and allow plan generation to be limited by external constraints. The decomposition information in HTN plans can also help guide plan execution. This paper provides a method for encoding PDDL Level 3 durative actions in an HTN formalism compatible with the SHOP2 planner. Efficient planning with these actions requires additional search control. We illustrate the utility of the technique with experimental results on the IPC 2004 AIRPORT domain, and explain how SHOP2 methods were written for this domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Constraint Model for Validating Plans with Durative Actions

Planning problems with durative actions represent one of the hot research topics in the area of AI planning. Because durative actions introduce numerical aspects to planning, constraint satisfaction technology is becoming more popular in solving this new type of planning problems. The paper describes a constraint programming approach for validating and finishing partially ordered plans with dur...

متن کامل

A Hierarchical Task Network Planner for Pathfinding in Real-Time Strategy Games

In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN ...

متن کامل

Stochastic Planning with Concurrent, Durative Actions

Stochastic Planning with Concurrent, Durative Actions

متن کامل

Probabilistic hierarchical planning over MDPs

In this paper, we propose a new approach to using probabilistic hierarchical task networks (HTNs) as an effective method for agents to plan in conditions in which their problem-solving knowledge is uncertain, and the environment is non-deterministic. In such situations it is natural to model the environment as a Markov decision process (MDP). We show that using Earley graphs, it is possible to ...

متن کامل

A Temporal Planning System for Level 3 Durative Actions of PDDL+

Many planning domains have temporal features that can be expressed as durations associated with actions. Unfortunately, the conservative model of actions of most temporal planners is not appropriate for some domains which require richer models. Level 3 of PDDL2.1 introduces a model of durative actions which includes local conditions and effects to be satisfied at different times during the exec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006